package com.Floyd;

import java.util.List;


public class TestMain {

	public static void main(String[] args){
		 Graph graph=new Graph();
		int[][] gArr=graph.getGraphArr();
		 Floyd f=new Floyd(5);
	    int begin=0;int end=4;
	    f.findCheapestPath(begin, end, gArr);
	    //list is the path line
	    List<Integer> list=f.getResultLine();
	    System.out.println(list);
	    //minM is the min path
	    int[][] minM=f.getDist();
	    System.out.println(minM[begin][end]);
	}
}
